Chromatic Equivalence of K 4 - Homeomorphs with Girth 9

نویسندگان

  • R. Hasni
  • A. Ahmad
  • F. Mustapha
چکیده

For a graph G, let P (G,λ) denote the chromatic polynomial of G. Two graphs G and H are chromatically equivalent (or simply χ−equivalent), denoted by G ∼ H, if P (G,λ) = P (H,λ). A graph G is chromatically unique (or simply χ−unique) if for any graph H such as H ∼ G, we have H ∼= G, i.e, H is isomorphic to G. A K4-homeomorph is a subdivision of the complete graph K4. In this paper, we discuss a pair of chromatically equivalent of K4homeomorphs with girth 9, that is, K4(1, 3, 5, d, e, f) and K4(1, 3, 5, d , e, f ). As a result, we obtain two infinite chromatically equivalent non-isomorphic K4-homeomorphs. AMS Subject Classification: 05C15

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Chromatic Equivalence Pair of a Family of K4-Homeomorphs

In this paper, we discuss a pair of chromatically equivalent of K4-homeomorphs of girth 11, that is, K4(1, 3, 7, d, e, f) and K4(1, 3, 7, d′, e′, f ′). As a result, we obtain two infinite chromatically equivalent non-isomorphic K4-homeomorphs. Mathematical Subject Classification: 05C15

متن کامل

A new result on chromaticity of K4-homoemorphs with girth 9

For a graph $G$, let $P(G,lambda)$ denote the chromatic polynomial of $G$. Two graphs $G$ and $H$ are chromatically equivalent if they share the same chromatic polynomial. A graph $G$ is chromatically unique if any graph chromatically equivalent to $G$ is isomorphic to $G$. A $K_4$-homeomorph is a subdivision of the complete graph $K_4$. In this paper, we determine a family of chromatically uni...

متن کامل

Chromatic uniqueness of a family of K4-homeomorphs

In this paper, we study the chromatic uniqueness of one family of K4-homeomorphs with girth 10. 2000 Mathematical Subject Classification. Primary 05C15.

متن کامل

On Chromatic Uniqueness of a Family of K4-Homeomorphs

In this paper, we study the chromatic uniqueness of one family of K4-homeomorphs with girth 10. 2000 Mathematics Subject Classification: 05C15

متن کامل

On Chromatic Uniqueness And Equivalence of K4-Homeomorphic Graphs

A K4-homeomorph is a subdivision of the complete graph with four vertices (K4). Such a homeomorph is denoted by K4(a,b,c,d,e,f) if the six edges of K4 are replaced by the six paths of length a,b,c,d,e,f, respectively. In this paper, we discuss the chromaticity of a family of K4-homeomorphs with girth 10. We also give sufficient and necessary condition for some graphs in the family to be chromat...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012